Adapting a Kidney Exchange Algorithm to Align with Human Values
نویسندگان
چکیده
The efficient allocation of limited resources is a classical problem in economics and computer science. In kidney exchanges, a central market maker allocates living kidney donors to patients in need of an organ. Patients and donors in kidney exchanges are prioritized using ad-hoc weights decided on by committee and then fed into an allocation algorithm that determines who get what—and who does not. In this paper, we provide an end-to-end methodology for estimating weights of individual participant profiles in a kidney exchange. We first elicit from human subjects a list of patient attributes they consider acceptable for the purpose of prioritizing patients (e.g., medical characteristics, lifestyle choices, and so on). Then, we ask subjects comparison queries between patient profiles and estimate weights in a principled way from their responses. We show how to use these weights in kidney exchange market clearing algorithms. We then evaluate the impact of the weights in simulations and find that the precise numerical values of the weights we computed matter little, other than the ordering of profiles that they imply. However, compared to not prioritizing patients at all, there is a significant effect, with certain classes of patients being (de)prioritized based on the human-elicited value judgments.
منابع مشابه
The Application of Least Square Support Vector Machine as a Mathematical Algorithm for Diagnosing Drilling Effectivity in Shaly Formations
The problem of slow drilling in deep shale formations occurs worldwide causing significant expenses to the oil industry. Bit balling which is widely considered as the main cause of poor bit performance in shales, especially deep shales, is being drilled with water-based mud. Therefore, efforts have been made to develop a model to diagnose drilling effectivity. Hence, we arrived at graphical cor...
متن کاملReconfiguration and optimal placement of distributed generations in distribution networks in the presence of remote voltage controlled bus using exchange market algorithm
Abstract: Since distribution networks have a large share of the losses in power systems, reducing losses in these networks is one of the key issues in reducing the costs of global networks, including issues Which has always been considered. In this thesis, the reconfiguration of the distribution network in the presence of distributed generation sources (DGs) with respect to two types of bus, P ...
متن کاملProduction Planning Optimization Using Genetic Algorithm and Particle Swarm Optimization (Case Study: Soofi Tea Factory)
Production planning includes complex topics of production and operation management that according to expansion of decision-making methods, have been considerably developed. Nowadays, Managers use innovative approaches to solving problems of production planning. Given that the production plan is a type of prediction, models should be such that the slightest deviation from their reality. In this ...
متن کاملCombined Economic and Emission Dispatch Solution Using Exchange Market Algorithm
This paper proposes the exchange market algorithm (EMA) to solve the combined economic and emission dispatch (CEED) problems in thermal power plants. The EMA is a new, robust and efficient algorithm to exploit the global optimum point in optimization problems. Existence of two seeking operators in EMA provides a high ability in exploiting global optimum point. In order to show the capabilities ...
متن کاملA Proposed Mechanism for the Iranian Model of Kidney Donation (A Comparison of the Iranian and Roth’s Models)
Optimal resource allocation by means of the price mechanism is one of the main duties of the economics. Optimum allocation is sometimes realized not through the price mechanism, but via assignment algorithms due to an insufficient number of agents on either side of the exchange. Facing the same problem, the kidney market may be considered as a type of market failure that calls for market design...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017